Computational Complexity of a Pop-up Book∗

نویسندگان

  • Ryuhei Uehara
  • Sachio Teramoto
چکیده

Origami is the centuries-old art of folding paper, and recently, it is investigated as computer science: Given an origami with creases, the problem to determine if it can be flat after folding all creases is NP-hard. Another hundreds-old art of folding paper is a pop-up book. A model for the pop-up book design problem is given, and its computational complexity is investigated. We show that both of the opening book problem and the closing book problem are NP-hard.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Complexity of a Pop-Up Book

Origami is the centuries-old art of folding paper, and recently, it is investigated as science. In this paper, another hundreds-old art of folding paper, a pop-up book, is studied. A model for the pop-up book design problem is given, and its complexity is investigated. We show that both of the opening book problem and the closing book problem are NP-hard.

متن کامل

Pop-up book MEMS

We present a design methodology and manufacturing process for the construction of articulated three-dimensional microstructures with features on the micron to centimeter scale. Flexure mechanisms and assembly folds result from the bulk machining and lamination of alternating rigid and compliant layers, similar to rigid-flex printed circuit board construction. Pop-up books and other forms of pap...

متن کامل

Pop - up book MEMS

We present a design methodology and manufacturing process for the construction of articulated three-dimensional microstructures with features on the micron to centimeter scale. Flexure mechanisms and assembly folds result from the bulk machining and lamination of alternating rigid and compliant layers, similar to rigid-flex printed circuit board construction. Pop-up books and other forms of pap...

متن کامل

Algorithms for Designing Pop-Up Cards

We prove that every simple polygon can be made as a (2D) pop-up card/book that opens to any desired angle between 0 and 360◦. More precisely, given a simple polygon attached to the two walls of the open pop-up, our polynomial-time algorithm subdivides the polygon into a single-degree-of-freedom linkage structure, such that closing the pop-up flattens the linkage without collision. This result s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006